Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
921	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory
922	The Complexity Map Mark W. Hissink Muller DNV-CIBIT (Det Norske Veritas) Bilthoven, The Netherlands Add to Reading List Source URL: complexitymap.com Language: English - Date: 2009-12-13 16:59:01 Ethology Computer graphics Scientific modeling Abstraction Complexity Visualization Prefuse Software architecture Software quality Science Computational science Infographics
923	Yuval Filmus Curriculum Vitæ Í 117 Oppenheimer Ln Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-10-31 15:18:39 Fellows of the Royal Society International Colloquium on Automata Languages and Programming Automated theorem proving Toniann Pitassi Daniel Filmus Symposium on Foundations of Computer Science Symposium on Theoretical Aspects of Computer Science Symposium on Theory of Computing Combinatorics Theoretical computer science Applied mathematics Computational complexity theory
924	Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the art Oded Goldreich Abstract. The purpose of this article is to correct the inaccurate account of this subject that is provided Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-22 08:07:12 Cryptographic protocols Computational complexity theory Proof theory Complexity classes Combinatorics Interactive proof system IP Soundness Non-interactive zero-knowledge proof Theoretical computer science Cryptography Applied mathematics
925	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics
926	Computational Complexity and Information Asymmetry in Financial Products (Working paper) Sanjeev Arora∗ Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2010-04-23 10:13:33 Differential calculus United States housing bubble Bonds Funds Structured finance Collateralized debt obligation Dense subgraph Derivative Copula Mathematical analysis Financial economics Mathematics
927	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-13 17:17:56 Computational complexity theory Abstract algebra Linear algebra NP-complete problems Logic in computer science Boolean satisfiability problem Time complexity PP Element distinctness problem Theoretical computer science Mathematics Algebra
928	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes
929	Egon Borger Erich Gradel Yuri Gurevich The Classical Decision Problem Add to Reading List Source URL: www.gbv.de Language: English - Date: 2007-11-05 08:28:23 Computability theory Model theory Complexity classes Metalogic Proof theory Decision problem Decidability Satisfiability First-order logic Theoretical computer science Computational complexity theory Mathematical logic
930	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-12 00:13:50 Complexity classes Boolean algebra Constraint programming Mathematical optimization Boolean satisfiability problem Constraint satisfaction problem NP-complete Belief propagation NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE